A novel approach to phylogenetic trees: d-Dimensional geometric Steiner trees

نویسندگان

  • Marcus Brazil
  • Doreen A. Thomas
  • Benny K. Nielsen
  • Pawel Winter
  • Christian Wulff-Nilsen
  • Martin Zachariasen
چکیده

We suggest a novel distance-based method for the determination of phylogenetic trees. It is based on multidimensional scaling and Euclidean Steiner trees in high-dimensional spaces. Preliminary computational experience shows that the use of Euclidean Steiner trees for finding phylogenetic trees is a viable approach. Experiments also indicate that the new method is comparable with results produced by Neighbor Joining [20].

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Geometric conditions for Euclidean Steiner trees in ℜd

We present geometric conditions that can be used to restrict or eliminate candidate topologes for Euclidean Steiner minimal trees in , d ≥ 2. Our emphasis is on conditions that are not restricted to the planar case (d = 2). For trees with a Steiner topology we give restrictions on terminal-Steiner connections that are based on the Voronoi diagram associated with the set of terminal nodes. We th...

متن کامل

Bottleneck Distances and Steiner Trees in the Euclidean d-Space

Some of the most efficient heuristics for the Euclidean Steiner minimal trees in the d-dimensional space, d ≥ 2, use Delaunay tessellations and minimum spanning trees to determine small subsets of geometrically close terminals. Their low-cost Steiner trees are determined and concatenated in a greedy fashion to obtain low cost trees spanning all terminals. The weakness of this approach is that o...

متن کامل

Steiner Trees with Degree Constraints: Structural Results and an Exact Solution Approach

In this paper we study the Steiner tree problem with degree constraints. Motivated by an application in computational biology we first focus on binary Steiner trees in which all node degrees are required to be at most three. We then present results for general degree-constrained Steiner trees. It is shown that finding a binary Steiner is NP-complete for arbitrary graphs. We relate the problem t...

متن کامل

Quantitative Illumination of Convex Bodies and Vertex Degrees of Geometric Steiner Minimal Trees

In this note we prove two results on the quantitative illumination parameter f (d) of the unit ball of a d-dimensional normed space introduced by K. Bezdek (1992). The first is that f (d) = O(2dd2 log d). The second involves Steiner minimal trees. Let v(d) be the maximum degree of a vertex, and s(d) of a Steiner point, in a Steiner minimal tree in a d-dimensional normed space, where both maxima...

متن کامل

P´olya Urn Models and Connections to Random Trees: A Review

This paper reviews P´olya urn models and their connection to random trees. Basic results are presented, together with proofs that underly the historical evolution of the accompanying thought process. Extensions and generalizations are given according to chronology: • P´olya-Eggenberger’s urn • Bernard Friedman’s urn • Generalized P´olya urns • Extended urn schemes • Invertible urn schemes ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Networks

دوره 53  شماره 

صفحات  -

تاریخ انتشار 2009